New generating functions for the G-function
نویسندگان
چکیده
منابع مشابه
The concentration function problem for $G$-spaces
In this note, we consider the concentration function problem for a continuous action of a locally compact group $G$ on a locally compact Hausdorff space $X$. We prove a necessary and sufficient condition for the concentration functions of a spread-out irreducible probability measure $mu$ on $G$ to converge to zero.
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملA Mthod for Generating the Turbulent Intermittency Function
A detection method based on sensitization of a squared double differentiated signal is developed which discriminates the turbulent zones from laminar zones quite accurately. The procedure adopts a variable threshold and a variable hold time of the order of the Kolmogorov time scale. The output file so generated, includes all the information for further analysis of the turbulent signal.
متن کاملOn composition of generating functions
In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...
متن کاملGenerating functions for generating trees
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the object. Generating trees lead to a fast computation of enumeration sequences (sometimes, to explicit formulae as well) and provide efficient random generation al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Polonici Mathematici
سال: 1973
ISSN: 0066-2216,1730-6272
DOI: 10.4064/ap-27-2-159-162